Disk scheduling system using probability of missed disk access

ABSTRACT

Admission of a new disk stream is based on probability of overcommitting disk bandwidth based on parameters related to the disk. This fixed parameters are determined either by obtaining or by investigating the desk. Probability functions of the disk parameters may be obtained. Exemplary disk parameters may be disk seek time, probabilistic determination of the amount of data exchange during a single exchange, and probabilistic information about reading versus writing.

PRIORITY

The present application claims priority from Provisional Application No. 60/601,391, filed Aug. 12, 2004, the contents of which are herewith incorporated by reference.

STATEMENT AS TO FEDERALLY SPONSORED RESEARCH

This application may have received funding under Grant No. EEC-9519152 NSF and No. IIS-0082826 NSF. The government may have certain rights to this invention.

BACKGROUND

Magnetic disk drives may be used for many different video applications. Examples include streaming media servers, digital hub devices such as TiVo, and TV studio and film production equipment.

When used for video, disk drives assign data blocks in one of two generally accepted paradigms: either in a round-robin sequence, or randomly.

The round robin placement uses a cycle based approach. This guarantees certain aspects of service quality. The random placement uses a deadline driven approach. This may have certain advantages such as delivery rate advantages with a single storage data block size, improved support for interactive applications and support for certain kinds of data reorganization. These latter applications may be supported with cycle based scheduling. However, cycle based scheduling may need to assume that certain disk parameters have their worst-case values. This can cause complexity and lack of efficiency.

Deadline driven scheduling can be configured efficiently in a way that encodes a low probability of disruptions. One important task includes limiting the number of streams to minimize the number of missed deadlines. This task is performed by the admission control part of the scheduler.

SUMMARY

The present application describes a statistical based admission control technique referred to as three random variable admission control, or TRAC. One aspect enables defining a maximum probability of missed deadlines.

BRIEF DESCRIPTION OF THE DRAWINGS

These and other aspects will now be described in detail with reference to the accompanying drawings, wherein:

FIG. 1A illustrates a read and write transfer profile of a specified disk drive;

FIG. 1B illustrates the parts of a disk drive, including the multiple platters and processing part;

FIG. 2 illustrates an integration region for specified parameters; and

FIGS. 3A and 3B illustrate the seek time profile and probability function respectively for a specific disk drive; and

FIG. 4 illustrates a flowchart of the admission control policy.

DETAILED DESCRIPTION

The general structure and techniques, and more specific embodiments which can be used to effect different ways of carrying out the more general goals are described herein.

The admission control algorithm which is used herein enables modeling a more comprehensive set of features for real-time storage and retrieval then many previous techniques. One aspect targets multi-stream architectures. Typical personal video recorders such as TiVos are often restricted to one recording and one playback stream. Such a set of streams has typically enjoyed minimal if any problems with disk bandwidth resources, especially if the video is being compressed. Hence, the scenario of one recording stream, one playback stream provides minimal barriers to the admission control procedures.

However, complex video control devices may manage multiple video and audio streams using FireWire, USB and/or a wireless connection. This provides a resource constrained large-scale or multiscale system.

According to aspects, the present system supports many different kinds of video access. It may be important to support variable bit rate streams in order to support certain kinds of compressed video such as MPEG-2 movies. It may also be important to support concurrent reading and writing of video streams.

One feature that is modeled and accounted for according to the present system, is that many disk drives provide less write bandwidth than read bandwidth. For example, FIG. 1A illustrates the read and write transfer profile of an exemplary disk drive, and FIG. 1B shows a block diagram of such a drive. The disk drive includes a plurality of platters 150, 151, 152, 159. A controller 160 controls the operation of the drive, according to the techniques described herein. The top curve of FIG. 1A shows the read profile, and the bottom curve shows the write profile.

According to the present system, the combined available bandwidth becomes a function of the mix of reading and writing. An embodiment describes using a dynamic bandwidth sharing mechanism as part of the admission control, which takes into account expected reading amounts, expected writing amounts, and other parameters.

Another important issue may be support for multizone discs. FIG. 1A illustrates how the transfer rates for disk drives may be different depending on the position of writing on the disk. The data is recorded in concentric “rings” (called zones) on each platter. The outermost ring has the longest circumference and can hence store the most data. Because a platter spins at a constant angular velocity, more data per time unit is transferred from a large ring as opposed to a small ring. The outermost zone of the disk may provide up to 30% more bandwidth then the innermost zone of the disk.

The present system may also support modeling of the variable seek time and the variable rotational latency that is naturally part of every data block that is read and written. Finally, this may support efficient data placement in random locations.

The technique is based on parameters of the disk and the multiple clients of the disk. For a specified scenario, the system may be service variable rate clients using deadline driven scheduling and data blocks that are allocated to a disk using a random placement policy. Server activity is observed periodically. The time interval over which observation is maintained is referred to as T_(svr).

This phase of the model is hence characterized by three random variables:

D(i) denotes the amount of the data to be retrieved or recorded for the client i during the observation window T_(svr).

{overscore (R_(Dr))} represents the average disk read bandwidth during the interval T_(svr) with no bandwidth allocation to writing, and

T_(seek)(av) denotes the average disk seek time during each observation time interval T_(svr).

T_(seek)(i) defines the disk seek time for client i during the interval T_(svr1). N_(rs) is defined as the number of retrieval streams, and n_(ws) is defined as the number of recording streams. Therefore, n=n_(rs)+n_(ws). Also, R_(Dw)(hat) represents the average disk bandwidth (here in megabytes per second) allocated for writing during T_(svr). Similarly, R_(Dr)(hat) represents the average bandwidth for reading. The mixed load of retrieving and recording clients provides an average combined disk bandwidth of R_(Dio)(av) which is constrained by R_(Dio)(av)=R_(Dr)(hat)+R_(Dw)(hat).

Consequently, the maximum data that can be read and written during each interval T_(svr) can be expressed by {overscore (R _(Dio))}x(T _(svr)−Σ_(i+1) ^(nrs+nws) T _(seek)(i))   (1)

Furthermore, if Σ_(i=1) ^(n)D(i) Represents the total read and write bandwidth requirement during T_(svr) from all streams n, then the probability of missed deadlines, p_(iodisk) can be computed by: $\begin{matrix} {{Piodisk} = {P\left\lbrack {{\sum\limits_{i = 1}^{n}{D(i)}} > \left( \quad{\overset{\_}{R_{dio}} \times \left( {T_{svr} - {\sum\limits_{i = 1}^{n}{T_{seek}(i)}}} \right)} \right)} \right\rbrack}} & (2) \end{matrix}$

The following describes operation during the worst-case scenario. However, a missed deadline, in a reasonable scenario, may be hidden by data buffering.

If T_(seek)(j) denotes the seek time for a disk access j, where j is an index for each disk during T_(svr), then the total seek time is: ${\sum\limits_{i = 1}^{n}{T_{seek}(i)}} = {{\sum\limits_{j = 1}^{m}{t_{seek}(j)}} = {m \times t_{seek}}}$

Where m denotes the number of seeks and t_(seek) is the average seek time, both during T_(svr). Because every seek operation is followed by a data block read or write, m can also be expressed by $m = \frac{\sum\limits_{i = 1}^{n}{D(i)}}{B_{disk}}$

where B_(disk) is the block size.

The appropriate substitutions allow arriving at the final expression for the probability of over-committing the disk bandwidth, which may translate into missed I/O deadlines. $\begin{matrix} {{Piodisk} = {{P\left\lbrack {{\sum\limits_{i = 1}^{n}{D(i)}} > \left( \frac{\overset{\_}{R_{Dio}} \times T_{svr}}{1 + \frac{\overset{\_}{t_{seek}} \times \overset{\_}{R_{Dio}}}{B_{disk}}} \right)} \right\rbrack} \leq {Preq}}} & (3) \end{matrix}$

Here, the random variable R_(Dio)(av), the average combined disk bandwidth for the reading and writing mix, has interesting properties which will be exploited.

The FIG. 1A illustration of an exemplary disk transfer rate for reading and writing with a modern multizone disk drive shows how that the average I/O bandwidth, that is the combined bandwidth, will change depending on the mix of read versus write allocation. A partition factor δ is defined herein that defines the percentage of disk bandwidth that is allocated for reading versus writing.

According to the present system, disk bandwidth sharing is set while considering how to partition the disk bandwidth for reading and writing, while maximizing resource utilization. This is done according to the following Design Goals for the admission control algorithm:

DG1: Share the total disk bandwidth between read and write request.

DG2: dynamically allocate the available disk bandwidth to read or write request on demand.

DG3: Support multiple bandwidth sharing policies according to defined definitions.

The following provides some exemplary definitions. It should be understood that there are many other definitions and policies that could be used, but the ones described herein may produce certain advantages.

DEFINITION 3.1: The non-reservation-based bandwidth sharing (NRBS) policy is defined as disk reading and writing request are served with no preference, i.e., no bandwidth reservation for either reading or writing exist.

DEFINITION 3.2.: The reservation-based bandwidth sharing (RBS) policy is defined as:

a fraction of the disk bandwidth is reserved for disk reading or writing. When disk bandwidth is reserved for writing it is termed Write-Reservation-based Bandwidth Sharing policy (WRBS). When disk bandwidth is reserved for reading, it is termed Read-Reservation-based bandwidth sharing policy (RRBS).

This issue is generically referred to an bandwidth sharing. The disk bandwidth is partitioned according to δ. As δ moves from 0 to 1, more bandwidth is allocated for reading and R_(Dio) varies from R_(Dw(av)) to R_(Dr(av)). Thus, R_(Dio(av)) can be expressed as: {overscore (R _(Dio))}=δ{overscore (R _(Dr))}+(1−δ) {overscore (βR_(Dw))}  (4)

Where R_(Dr(av)) and R_(Dw(av)) are the two random variables. The relationship between the average read and the average write bandwidth is modeled with the parameter β=R _(Dw) /R _(Dr.) β can be obtained experimentally from disk profiling as explained herein. For a multi-zone disk, the ratio between write and read bandwidth may differ from zone to zone.

Let β_(k) denote the ratio between write and read bandwidth for zone k. For example, for a Seagate Cheetah X15 disk, β_(k)=0.668, β1=0.679, and β2=0.673 (see Table 2) For this disk model, βk varies about 13% (βk ε [0.668, 0.757]) across all zones. It can be proved that β ε [βkmin,βkmaz] =[0.668, 0.757], where βkmin and βkmaz are the minimum among all βk respectively , and k ε [l,w] and w is the total number of zones. It is generally true that β does not change much. Based on the strong law of large numbers, ${\lim_{n\rightarrow\infty}\frac{\overset{\_}{R_{DW}}}{\overset{\_}{R_{Dr}}}} = \frac{\overset{\_}{\mu\quad R_{DW}}}{\overset{\_}{\mu\quad R_{DW}}}$

The model may be simplified by using the limit value as β in further calculations. Therefore, Eq. 4 Can be rewritten as: {overscore (R _(Dio))}=δ{overscore (R _(Dr))}+(1−δ)βR _(Dr)   (5)

To satisfy DG1 and DG2, the partition factor δ must be dynamically adjusted according to the system conditions, i.e., the ratio between the read and write load. This behavior may be modeled by the mixed-load factor α $\begin{matrix} {\alpha = \frac{{rD}_{r}}{r_{Dr} + \frac{R_{DW}}{\beta}}} & (6) \end{matrix}$ where r_(Dr) and r_(Dw) denote the current disk read and write bandwidth, respectively. For example, with α=1 only reading clients exist in the system, and α=0 implies only recording clients are in the system.

Next, δ is then computed under disk real loading r_(Dr) and write load r_(Dw) conditions, using different bandwidth sharing policies, assuming that r_(Dr)+r_(Dw)>0. We conjecture the following theorem.

THEOREM 3.3: To satisfy the design goals DG1, DG2, and DG3, $\delta = {\alpha = \frac{R_{Dr}}{r_{Dr} + \frac{R_{Dw}}{\beta}}}$

The bandwidth sharing policies can be adjusted according to application. Disk bandwidth with a mixed load factor α can be expressed as: {overscore (R _(Dio))}={overscore (αR _(Dr))}+(1−α){overscore (βR _(Dr))}  (7)

This equation considers two extreme cases as well: (1) when there is only read load, i.e., α=1, R_(Dio)=R_(Dr), and

(2) when there is only write load, i.e., α=o, R_(Dio)=βR_(Dr)=R_(Dw).

Based on Eq. 7, Eq. 3 can be further generalized to $\begin{matrix} {{- {P\left\lbrack {{\sum\limits_{i = 1}^{n}{D(z)}} > \left( \frac{\left( {{\alpha\quad\overset{\_}{R_{Dr}}} + {\left( {1\quad\ldots\quad\alpha} \right)\beta\quad\overset{\_}{R_{Dr}}T_{svr}}} \right.}{1 + \frac{\overset{\_}{\left. {\left. {{t_{seek} \times \left( {{\alpha\quad R_{Dr}} +} \right)1} - a} \right)\beta\quad R_{Dr}} \right)}}{B_{disk}}} \right)} \right)}} \leq {Preq}} & (8) \end{matrix}$

Where α can be approximated with Eq. 9, in which μ_(i) denotes the mean value of random variable D(i). $\begin{matrix} {\alpha \approx \frac{\sum\limits_{i = 1}^{n_{rs}}{\mu\quad i}}{{\sum\limits_{i = 1}^{n_{rs}}{\mu\quad i}} + \frac{\sum\limits_{i = 1}^{n_{ws}}{\mu\quad i}}{\beta\quad}}} & (9) \end{matrix}$

Let X, Y and Z denote

Σ_(i=1) ^(n)D(i),{overscore (t_(seek))} and {overscore (R_(Dr))} respectively. The probability

In Eq. 8 can then be evaluated as follows $\begin{matrix} \begin{matrix} {{Piodisk} = {P\left\lbrack {\left( {X,Y,Z} \right)\quad\varepsilon\quad\Re} \right\rbrack}} \\ {= {\int{\int{\int_{\Re}{{{fxyz}\left( {x,y,z} \right)}{\mathbb{d}x}{\mathbb{d}y}{\mathbb{d}z}}}}}} \end{matrix} & (10) \\ {Where} & \quad \\ {\Re = \left\{ \left( {X,Y,Z} \right) \middle| {X > \left( \frac{\left( {{\alpha\quad Z} + {\left( {1 - \alpha} \right)\beta\quad Z}} \right) \times {Tsvr}}{1 + \frac{Y \times \left( {{\alpha\quad Z} + {\left( {1 - \alpha} \right)\beta\quad Z}} \right)}{B_{disk}}} \right)} \right.} & (11) \end{matrix}$

And f_(xyz) (x,y,z) is the joint probability density function (“pdf”) of X, Y, Z.

FIG. 2 shows the integration region

of Eq. 11 with T_(svr)=1 second, B_(disk)=1 MB, α=0.5, and β=0.8. FIG. 2 shows only a small portion of the 3D space, where 0<X<80 MB/s, 0<Y<14 ms and 0<Z, 70 MB/s, which covers the operation parameters for most modern disk drives. Since the three random variables Σ_(i=1) ^(n)D(i),{overscore (t_(seek))} and {overscore (R_(Dr))} independent, this can be written s: fxyz(x,y,z)=fx(x) fy(y) fz(z)   (12)

Where fx (x), fy(y) and fz(z) are the probability density functions of X, Y and Z, respectively.

fx (x), fy (y), and fz(z), can be derived as follows:

Determination of fx(x): pdf of Σ_(i=1) ^(n)D(i)

D(i), as described above, denotes the amount of data that client i reads or writes during T_(svr). Since D(i) is only dependent on the stream bandwidth characteristics of each client, D(1)-D(n) are independent random variables. According to the central limit theorem, Σ_(i=1) ^(n)D(i)approaches a normal distribution with mean Σ^(n) _(i=1) μi(fix) and variance Σ^(n) _(i=1(fix)) where ui and σ² denote the mean value and variance of D(i), respectively². Therefore, the probability density function of Σ_(i=1) ^(n)D(i) may be expressed as: $\begin{matrix} {{{fx}(x)} = {{\frac{1}{\left. \sqrt{}2 \right.{\prod{\sum\limits_{i = 1}^{n}\sigma_{i}^{2}}}}e} - {\frac{\left\lbrack {x - {\sum\limits_{i = 1}^{n}{\mu\quad i}}} \right\rbrack^{2}}{2 \times {\sum\limits_{i = 1}^{n}\sigma_{i}^{2}}}({fix})}}} & (13) \end{matrix}$

The other fs may be obtained in similar ways.

Fy(i) is a probability density function of t_(seek) Eq. 2 explains that $\overset{\_}{t_{seek}} = \frac{\sum\limits_{j = 1}^{rh}\overset{\_}{t_{seek}(j)}}{m}$ which shows that t_(seek) is dependent on m variables t_(seek) (j), with j ε [l,m]. Due to the random data placement, these m random variables are independently and identically distributed with mean value μt_(seek) (j) and variance σ² t_(seek) (j). Assuming m>30, by the central limit theorem t _(seek) also has a normal distribution with mean μ²t_(seek) (j) and variance σ² t_(seek) (j).

Since $m = \frac{\sum\limits_{i = 1}^{n}{D(i)}}{B_{disk}}$ has a normal distribution and B_(disk) is a constant; furthermore m is normally distributed with mean $\frac{\sum\limits_{i = 1}^{n}{\mu\quad i}}{B_{disk}}$ and variance $\frac{\sum\limits_{i - 1}^{n}\delta_{i}^{2}}{{B2}_{disk}}.$ To simplify the model, m can be approximated with its mean value in later derivations. This allows obtaining the probability density function of t_(seek) as: $\begin{matrix} {{{fy}(\gamma)} \approx {\frac{1}{\sqrt{2{\pi_{t_{seek}}^{2}(j)}}}{\mathbb{e}}^{{- {\frac{\sum\limits_{i - 1}^{n}\mu_{i}}{2B_{disk}}{\lbrack\frac{\gamma - {\mu_{t_{seek}}{(j)}}}{\mu_{t_{seek}}{(j)}}\rbrack}}}2}}} & (14) \end{matrix}$ Determination of μt_(seek) (j) and σt_(seek) (j)

Let U_(i) denote the rotational latency for disk access j and let Sj denote the percentage value (between 0 and 100) of the total disk storage capacity. The rotational latency may be considered to be part of the seek time t_(seek)(j). The relationship among t_(seek)(j), S_(j), and U_(j) can be established through disk profiling and modeling as $\begin{matrix} {{t_{seek}(j)} = \left\{ \begin{matrix} {a_{1} + {b_{1}\sqrt{S_{j} + U_{j}}}} & {{{if}\quad 0} \leq S_{j} \leq r} \\ {a_{2} + {b_{2}S_{j}} + U_{j}} & {{{if}\quad r} < S_{j} \leq 100} \end{matrix} \right.} & (15) \end{matrix}$

Where a1, b1, a2, b2 and r are the disk seek modeling parameters. Because of the random data placement, both Sj and Uj follow a uniform distribution with pdfs ${{f_{{sj}\quad}(s)} = {{\frac{1}{100}\left( {s \in \left\lbrack {0,100} \right\rbrack} \right)\quad{and}\quad{f_{uj}(u)}} = {\frac{1}{h}\left( {u \in \left\lbrack {0,h} \right\rbrack} \right)}}},$ where h denotes the maximum rotational latency. This allows deriving the pdf of t_(seek)(j) and computing μt_(seek) (j) and t_(seek)(j)

FIG. 3(a) shows the seek time profile of a Seagate cheetah x15 disk which has the following parameters: a1=1, b1=0.6, a2=2.1, b2=0.05, r=5, and h=4 ms. FIG. 3(b) shows a good match of the derived pdf of t_(seek(j)), with the empirically measured relatively frequency histogram. Using the pdf of tseek (j), μtseek (j)=6.62 ms, t_(seek)(j)=1.85 ms is obtained.

fz(z)can also be obtained as a probability density function of RDr

Let RD_(r)(j) denote the disk read bandwidth for disk access j during Tsvr. Then the average read bandwidth RDr can be computed as $\overset{\_}{R_{Dr}} = \frac{\sum\limits_{j - 1}^{m}{R_{Dr}(j)}}{m}$

where these m random variables are independently and identically distributed with mean value RDr(j) and variance μRD_(r)(j). Following similar reasoning in as that above, RDr also approaches a normal distribution with pdf $\begin{matrix} {{{fz}(z)} \approx {\frac{1}{\sqrt{2\pi\quad{\sigma_{R_{Dr}}^{2}(j)}}}{\mathbb{e}}^{{- {\frac{\sum\limits_{i = 1}^{n}\mu_{i}}{2B_{disk}}{\lbrack\frac{z - {\mu_{R_{Dr}}{(j)}}}{\sigma_{R_{Dr}}{(j)}}\rbrack}}}2}}} & (16) \end{matrix}$

Determination of μ RDr (j) and σ RDR(j) is carried out as follows.

Most magnetic disk drives feature variable transfer rates due to a technique called zone-bit recording (ZBR), which increases the amount of data being stored on a track as a function of its distance from the disk spindle. the variable zone transfer rates is modeled with RDr(j). Let L denote the staring location of each disk access during t_(svr). L can be quantified using the percentage value of the total disk capacity, i.e., L ε [0,100]. From the disk transfer rate profile in FIG. 1, the relationship between RDr(j) and L is modeled as $\begin{matrix} {{R_{Dr}(j)} = \left\{ \begin{matrix} v_{1} & {if} & {0 \leq L \leq {k_{1}\left( {L \in {{Zone}\quad 1}} \right)}} \\ \vdots & \vdots & \quad \\ v_{w} & {if} & {k_{w - 1} < L \leq {k_{w}\left( {L \in {{Zone}\quad w}} \right)}} \end{matrix} \right.} & (17) \end{matrix}$

Where w is the number of zones, and vi and ki model the multizone characteristics, where i ε[l,w], ν ₁> . . . >ν_(w),0<k ₁ < . . . <k _(w)=100, and [0,k ₁ ][k ₁ ,k ₂ ], . . . , [k ¹⁻¹ ,k _(i) ], . . . , [k _(w)=₁ , k _(w)] represent zones 1,2, . . . i, . . . w respectively. These w,ν_(i) and k_(i) are termed disk transfer rate modeling parameters. Because of the random data placement, L is uniformly distributed with pdf ${f_{L}(l)} = {\frac{1}{100}{\left( {1 \in \left\lbrack {0\text{,}100} \right\rbrack} \right).}}$ Consequently, with the introduction of Dirac delta functions [18] the pdf F_(RDr)(r) can be derived as: $\begin{matrix} {{f_{R_{Dr}}(r)} = {\sum\limits_{i = 1}^{w}\quad{\frac{k_{i} - k_{i} - 1}{100}{\delta\left( {r - v_{i}} \right)}}}} & (18) \end{matrix}$

The probability density function of R_(Dr)(j)allows determination of μR_(Dr) (j) and σR_(Dr) (j). For example, for a Seagate cheetah X15 disk, μRDr (j)=52.26 MB/s and σR_(Dr) (j)=5.33 MB/s. The final step is to apply μRDr(j) to Eq. 16 resulting in the pdf for R_(Dr).

The above has described how to determine the necessary components to evaluate piodisk, the probability of over-committing the disk bandwidth.

The above extensively define the probability of missed deadlines. Those probabilities are then incorporated into a complete admission control procedure{s} which supports the bandwidth sharing policies. A flowchart of this is shown in FIG. 4. The flowchart may be executed within the control of 160 that is already present within the disk drive, or alternatively may be executed within any external controller or any device in any way associated with the system. The flowchart is divided into two basic components. The disk model 401-407 finds information about the disk itself which is being used for the application. The present embodiment describes determining this information through analysis, but this may be as simple as reading the information from prestored parameters on the disk. The admission decision module in steps 408-818 carries out the actual admission.

The modeling needs to be evaluated only when a new disk or other device is introduced into the system. 401 and 402 respectively represent determining the maximum rotational latency, and profiling the seek time. The seek profile parameters are used as part of equation 15 above. These values are used to obtain the mean and variance of tseek(j) at 403. 404 selects the optimal block size and 405 profiles the disk transfer rates. The results produce the modeling parameters from equation 17. At 406, the mean and variance of rdr(j) is obtained as described above. At 407, the relationship between the read and write, and the value data is determined.

As an example, assume the disk transfer rate profile of the Seagate disk of the type shown in FIG. 1A. Table 2 lists the β_(k) value for each of the disc zones. TABLE 2 Zoning information of a Seagate Cheetah X15 (model ST336752LC) disk. Zone Size Read Write β^(α) Start End 0 12 57.5 38.4 0.66 0 12 1 3 55.4 37.6 0.67 12 15 2 3 54.7 36.8 0.67 15 18 3 4,000 52.7 36.2 0.68 18.94 23,040 4 3,000 50.6 35.3 0.69 23.04 26,112 5 2,500 48.1 34.5 0.71 26.11 28,672 6 3,000 45.6 33.1 0.72 28.67 31,744 7 2,500 43.6 32.2 0.73 31.74 34,304 8 2,500 41.9 31.7 0.75 34.30 36,864 ^(α)Ratio between write and read data transfer rate of a zone.

For this specific disk, β_(k) may vary slightly between 0.668 and 0.757. β is also bounded by the same range as β_(k). This enables determining u_(RDW(J)), which represents the disk write bandwidth for disk access J. during t_(svr) with no bandwidth allocation for reading. The model can be simplified by approximating beta by its limit $\frac{\mu_{\overset{\_}{R_{Dw}}}}{\mu_{\overset{\_}{R_{Dw}}}}$

For example, the value for the Cheetah X15 is μβ=0.690337.

Note that these disk modeling procedures only need to be evaluated once for each disk drive. This could be done before the system is started in an off-line mode, or online, for example when a new disk is introduced into a streaming server.

The admission decision module is carried out, in contrast, each time there is a new stream request. It starts at when a new client request is received at 408. If the request is for recording a stream, then estimates of the mean and variance of the new variable bit rate stream are also provided. If the stream is later admitted, these values will be stored in a repository. Therefore, when the stream request is retrieved, mean and variance are simply retrieved from the internal database.

409 implements the bandwidth sharing policies. In the case of nrbs, this becomes a pass through.

At 410, the mixed-load factor a is updated according to equation 9, and the parameters are calculated at 411, 412 and 413, as described above. 411, calculates or updates the probability density function of the seek time, 412 calculates/updates the probability density function of D, and 413 updates the probability density function of the disk bandwidth characteristics.

At 414, the overload probability P_(iodisk) is computed using equation 10. The decision whether to admit or not is carried out by comparing the probability with the rejection probability at 415. If greater, than the stream request is rejected, otherwise the client request is admitted, at 416, and the session information is added to he internal database.

409 enables policy decisions, and allows providing preferential treatment to either the retrieval or the recording requests. These are referred to as reservation based airing policies, described in definition 3.2. The write rbs denotes a fraction of the disc's read/write capacity that must be reserved for writing. The maximum read load should not exceed that. Hence, at 409, the system read load is added to the new stream, and compared with this limit. The evaluation can be $\frac{{real}\quad{load}}{{total}\quad{read}\quad{capacity}} \approx \frac{\sum\limits_{i = 1}^{\mu_{rs}}\quad u_{i}}{\mu_{R_{Dr}}}$ where μ_(RDr) is the mean value of the random variable R_(Dr)(j) (see above) and μi(iε[l,n_(ws)]) denote the mean value for each variable recording stream.

If the threshold is not exceeded, than the stream may be further evaluated equivalently to the non-reservation policy, else the request is rejected.

Analogously, the read rbs denotes the portion of the discs read/write capacity that is reserved for reading. The fraction of the right load is evaluated and compared with the limit. This a evaluation can be similarly or analogously approximated by $\frac{{writing}\quad{{load}/\beta}}{{total}\quad{reading}\quad{capacity}} \approx \frac{\sum\limits_{i = 1}^{n_{ws}}\quad{\mu_{i}/\beta}}{\mu_{R_{Dr}}}$ which is the mean value of the random variable R_(Dr)(j) and μi(iε[l,N_(ws)]) denote the mean value for each VBR recording stream.

Another embodiment describes multiple disks in the system. For purposes of this embodiment, the number of disks in the system is denoted as ε.

The read write resource to support n streams is scaled by a factor of 1/ε on average for each individual disk.

Σ_(i=1) ^(n)D(i)denotes the total R/W resource requirements during Tsvr. Thus, the average amount of data to be stored to or retrieved from each disk during T_(svr) can be computed as λavg ${\lambda\quad{avg}} = \frac{\sum\limits_{i = 1}^{n}\quad{D(i)}}{ɛ}$ from each disk during. Assuming a random data placement across the ε disks, the R/W resource requirement λ_(i) for disk i during T_(svr) can be approximated with ${{\lambda\quad i} \approx {\lambda\quad{avg}}} = {{\frac{\sum\limits_{j = 1}^{n}\quad{D(j)}}{ɛ}\quad{where}\quad i} \in {\left\lbrack {1,ɛ} \right\rbrack.\quad i} \in {\left\lbrack {1,ɛ} \right\rbrack.}}$ Recall that Σ_(i=1) ^(n)D(i) follows a normal distribution (see above) and since ε is constant, λi also approaches a normal distribution with mean value $\mu_{\lambda\quad i} = {\frac{\sum\limits_{i = 1}^{n}\quad\mu_{i}}{ɛ}.}$ Consequently, following analogous reasoning as in the single disk case, the admission control criteria is modified to: $\begin{matrix} {{Piodisk} = {P\left\lbrack {\frac{\sum\limits_{i = 1}^{n}\quad{D(i)}}{ɛ} > \left( \frac{\alpha_{\overset{\_}{R_{Dr}}} + {\left( {1 - a} \right)\beta_{\overset{\_}{R_{Dr}}}{xT}_{svr}}}{1 + \frac{{\overset{\_}{t_{seek}}{x\left( {\alpha_{\overset{\_}{R_{Dr}}} +} \right)}1} - {\alpha\beta}_{\overset{\_}{R_{Dr}}}}{B_{disk}}} \right)} \right\rbrack}} & (19) \end{matrix}$

Note that the probability density functions need to be updated to reflect the decreased mean the variance values for the load on each disk. Furthermore the number of seek operations will also be approximately evenly distributed across all disks.

Importantly, it has been found that the benefits of this technique may increase linearly with the number of disks. Computational complexity may depend on the integration region and other disk parameters.

Although only a few embodiments have been disclosed in detail above, other embodiments are possible and the inventors intend these to be encompassed within this specification. The specification describes specific examples to accomplish a more general goal that may be accomplished in other way. This disclosure is intended to be exemplary, and the claims are intended to cover any modification or alternative which might be predictable to a person having ordinary skill in the art. For example, of the rules and design goals can be obtained. Moreover, the disk modeling may be substituted by simple import of characteristics of the disk, for example. While the admission decision is described as being based on probability density functions, it should be understood that any parameter related to probability may be substituted.

Also, the inventors intend that only those claims which use the words “means for” are intended to be interpreted under 35 USC 112, sixth paragraph. Moreover, no limitations from the specification are intended to be read into any claims, unless those limitations are expressly included in the claims. 

1. A method, comprising: determining information related to an average amount of disk reading relative to an average amount of disk writing; and allowing additional information to be scheduled for disk reading and/or disk writing based on said information.
 2. A method as in claim 1, wherein said allowing comprises determining a probability of overcommitting disk bandwidth, and comparing said probability with a threshold, and allowing additional information to be scheduled based on said comparing.
 3. A method as in claim 1, wherein said probability of overcommitting disk bandwidth is defined as a function of disk parameters, and amounts of data.
 4. A method as in claim 3, wherein one of said disk fixed parameters is a disk seek time.
 5. A method as in claim 3, wherein said one of said disk fixed parameters is a disk bandwidth.
 6. A method as in claim 3, wherein one of said fixed disk parameters is a disk reading bandwidth for a read operation and is a disk writing bandwidth for a write operation.
 7. A method as in claim 1, further comprising determining a parameter related to a probability of an amount of data exchange with a disk from a client, and wherein said allowing comprises using said parameter to determine whether to allow said information to be scheduled.
 8. A method as in claim 1, further comprising determining a parameter related to a probability of disk seek time, and said allowing comprises using said parameter to determine whether to allow said information to be scheduled.
 9. A method as in claim 8, wherein said parameter is based on mean of the disk seek time and variance of the disk seek time.
 10. A method as in claim 1, further comprising determining a parameter related to probability of average bandwidth of the disk, and said allowing comprises using said parameter to determine whether to allow said information to be scheduled.
 11. A method as in claim 1, further comprising determining a parameter related to an average distance between a spindle of the disk and a writing location of the desk, and using said parameter to determine whether to allow said information to be scheduled.
 12. A method as in claim 1, further comprising determining a first parameter related to a probability of an amount of data exchange with a disk from a client, determining a second parameter related to a probability of disk seek time, determining a third parameter related to a probability of disk seek time, and said allowing comprises using said first, second and third parameters to determine whether to allow said information to be scheduled.
 13. A method as in claim 12, wherein said first, second and third parameters are based on probability density functions of the parameters.
 14. A method as in claim 1, wherein there are a plurality of disks, and said allowing comprises scaling based on a plurality of disks.
 15. A method, comprising: determining information about at least one disk which will be used to store information; using said information to determine whether to admit a new stream, said using comprising determining a probability of overcommitting disk bandwidth from all of a first parameter related to seek time, a second parameter related to disk bandwidth, and a third parameter related to amount of amount of data exchanged during a disk access.
 16. A method as in claim 15, wherein said first, second and third parameters include probability density functions related to said parameters.
 17. A method as in claim 16, wherein further comprising at least one of said first, second and third parameters also include a load factor that relates to a probability of disk access being reading versus writing.
 18. A method as in claim 16, wherein at least one of said first, second and third parameters also includes a zone factor that relates probabilistically to a distance of writing relative to a spindle of the disk. probability of over-committing the disk bandwidth
 19. A system, comprising: A disk writing controller, determining information related to an average amount of disk reading relative to an average amount of disk writing, and allowing additional information to be scheduled for disk reading and/or disk writing based on said information.
 20. A system as in claim 19, further comprising a disk part, that allows said disk reading and said disk writing.
 21. A system as in claim 19, wherein said disk writing controller computes a probability of overcommitting disk bandwidth as a function of disk parameters, and amounts of data.
 22. A system as in claim 21, wherein one of said disk fixed parameters is a disk seek time.
 23. A system as in claim 21, wherein said one of said disk fixed parameters is a disk bandwidth.
 24. A system as in claim 21, wherein one of said fixed disk parameters is a disk reading bandwidth for a read operation and is a disk writing bandwidth for a write operation.
 25. A system as in claim 19 wherein said controller further determines a parameter related to probability of average bandwidth of the disk, and uses said parameter to determine whether to allow said information to be scheduled.
 26. A system as in claim 19, wherein said controller further determines a parameter related to an average distance between a spindle of the disk and a writing location of the desk, and uses said parameter to determine whether to allow said information to be scheduled.
 27. A system as in claim 19, wherein said controller determines a first parameter related to a probability of an amount of data exchange with a disk from a client, a second parameter related to a probability of disk seek time, a third parameter related to a probability of disk seek time, and uses said first, second and third parameters to determine whether to allow said information to be scheduled.
 28. A system as in claim 27, wherein said first, second and third parameters are based on probability density functions of the parameters.
 29. A system as in claim 20, further comprising at least one additional disk, and said controller carries out scaling based on a plurality of disks.
 30. A system, comprising: A characterization part, storing information about at least one disk which will be used to store information; A controller, using said information to determine whether to admit a new stream, based on a probability of overcommitting disk bandwidth from all of a first parameter related to seek time, a second parameter related to disk bandwidth, and a third parameter related to amount of amount of data exchanged during a disk access.
 31. A system as in claim 30, wherein said first, second and third parameters include probability density functions related to said parameters. 